ELKI: A Software System for Evaluation of Subspace Clustering Algorithms
نویسندگان
چکیده
In order to establish consolidated standards in novel data mining areas, newly proposed algorithms need to be evaluated thoroughly. Many publications compare a new proposition – if at all – with one or two competitors or even with a so called “näıve” ad hoc solution. For the prolific field of subspace clustering, we propose a software framework implementing many prominent algorithms and, thus, allowing for a fair and thorough evaluation. Furthermore, we describe how new algorithms for new applications can be incorporated in the framework
منابع مشابه
ELKI in Time: ELKI 0.2 for the Performance Evaluation of Distance Measures for Time Series
ELKI is a uni ed software framework, designed as a tool suitable for evaluation of di erent algorithms on high dimensional realvalued feature-vectors. A special case of high dimensional real-valued feature-vectors are time series data where traditional distance measures like Lp-distances can be applied. However, also a broad range of specialized distance measures like, e.g., dynamic time-warpin...
متن کاملNonlinear System Identification Using Hammerstein-Wiener Neural Network and subspace algorithms
Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsyst...
متن کاملA partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملSubspace MOA: Subspace Stream Clustering Evaluation Using the MOA Framework
Most available static data are becoming more and more highdimensional. Therefore, subspace clustering, which aims at finding clusters not only within the full dimension but also within subgroups of dimensions, has gained a significant importance. Recently, OpenSubspace framework was proposed to evaluate and explorate subspace clustering algorithms in WEKA with a rich body of most state of the a...
متن کاملAssessment of the Performance of Clustering Algorithms in the Extraction of Similar Trajectories
In recent years, the tremendous and increasing growth of spatial trajectory data and the necessity of processing and extraction of useful information and meaningful patterns have led to the fact that many researchers have been attracted to the field of spatio-temporal trajectory clustering. The process and analysis of these trajectories have resulted in the extraction of useful information whic...
متن کامل